/**
 * Created with IntelliJ IDEA.
 * Description:
 * User: 98152
 * Date: 2024-09-11
 * Time: 8:23
 */
public class test {
    public static void main(String[] args) {
          BinaryTree binaryTree = new BinaryTree();
//        BinaryTree.TreeNode root = binaryTree.createTree();
//        //binaryTree.preOrder(root);
//        //binaryTree.inOrder(root);
////        binaryTree.postOrder(root);
////        System.out.println();
////        binaryTree.size(root);
////        System.out.println(BinaryTree.nodeSize);
////        System.out.println(binaryTree.size2(root));
//        binaryTree.getLeafNodeCount1(root);
//        System.out.println(BinaryTree.leafSize);
//        System.out.println(binaryTree.getLeafNodeCount2(root));
//        System.out.println(binaryTree.getKLevelNodeCount(root,4));
//        System.out.println(binaryTree.getHeight(root));
//        System.out.println(binaryTree.find(root,'H'));
//        binaryTree.levelOrder(root);

        char[] ch1 = {'E', 'F', 'H', 'I', 'G', 'J', 'K'};
        char[] ch2 = {'H', 'F', 'I', 'E', 'J', 'K', 'G'};
        BinaryTree.TreeNode root = binaryTree.buildTree(ch1, ch2);

    }
}
